Efficient Solution of Elliptic Partial Differential Equations via Effective Combination of Mesh Quality Metrics, Preconditioners, and Sparse Linear Solvers

نویسندگان

  • Jibum Kim
  • Shankar Prasad Sastry
  • Suzanne M. Shontz
چکیده

In this paper, we study the effect the choice of mesh quality metric, preconditioner, and sparse linear solver have on the numerical solution of elliptic partial differential equations (PDEs). We smoothe meshes on several geometric domains using various quality metrics and solve the associated elliptic PDEs using the finite element method. The resulting linear systems are solved using various combinations of preconditioners and sparse linear solvers. We use the inverse mean ratio and vertex condition number metrics in addition to interpolation-based, scale-variant and scaleinvariant metrics. We employ the Jacobi, incomplete LU, and SSOR preconditioners and the conjugate gradient, minimum residual, generalized minimum residual, and bi-conjugate gradient stabilized solvers. We focus on determining the most efficient quality metric/preconditioner/linear solver combination for the numerical solution of various elliptic PDEs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel Sparse Approximate Inverse Preconditioners for Adaptive Mesh Refinement∗

We present an efficient and effective preconditioning method for time-dependent simulations with dynamic, adaptive mesh refinement and implicit time integration. Adaptive mesh refinement greatly improves the efficiency of simulations where the solution develops steep gradients in small regions of the computational domain that change over time. Unfortunately, adaptive mesh refinement also introd...

متن کامل

Faster PDE-based simulations using robust composite linear solvers

Many large-scale scientific simulations require the solution of nonlinear partial differential equations (PDEs). The effective solution of such nonlinear PDEs depends to a large extent on efficient and robust sparse linear system solution. In this paper, we show how fast and reliable sparse linear solvers can be composed from several underlying linear solution methods. We present a combinatoria...

متن کامل

Efficient Solution of Anisotropic Lattice Equations by the Recovery Method

In a recent paper, the authors introduced the recovery method (local energy matching principle) for solving large systems of lattice equations. The idea is to construct a partial differential equation along with a finite element discretization such that the arising system of linear equations has equivalent energy as the original system of lattice equations. Since a vast variety of efficient sol...

متن کامل

Efficient Solution of Anisotropic Lattice Equations

In a recent paper, the authors introduced the recovery method resp. local energy matching principle for solving large systems of lattice equations. The idea is to construct a partial differential equation along with a finite element discretisation such that the arising system of linear equations has equivalent energy as the original system of lattice equations. Since a vaste variety of efficien...

متن کامل

Sparse Approximate Solution of Partial Differential Equations∗

A new concept is introduced for the adaptive finite element discretization of partial differential equations that have a sparsely representable solution. Motivated by recent work on compressed sensing, a recursive mesh refinement procedure is presented that uses linear programming to find a good approximation to the sparse solution on a given refinement level. Then only those parts of the mesh ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010